A probabilistic analysis of the Floyd-Rivest expected time selection algorithm
نویسندگان
چکیده
In this work we present a probabilistic analysis of the Floyd-Rivest expected time selection algorithm. In particular we show that a refinement of the bootstrapped version of the FloydRivest algorithm that determines the C-th order statistic by performing an expected n + C + O(n) number of comparisons can be made into a randomized algorithm that performs n + C +O(n log n) comparisons with probability at least 1− 1/n, for any constant ρ > 0.
منابع مشابه
Randomized selection revisited
We show that several versions of Floyd and Rivest’s algorithm Select for finding the kth smallest of n elements require at most n+min{k, n− k}+ o(n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Our computational results confirm that Select may be the best algorithm in practice.
متن کاملA New Multi-objective Model for Multi-mode Project Planning with Risk
The purpose of this problem is to choose a set of project activities for crashing, in a way that the expected project time, cost and risk are minimized and the expected quality is maximized. In this problem, each project activity can be performed with a specific executive mode. Each executive mode is characterized with four measures, namely the expected time, cost, quality and risk. In this pap...
متن کاملRandomized selection with tripartitioning
We show that several versions of Floyd and Rivest’s algorithm Select [Comm. ACM 18 (1975) 173] for finding the kth smallest of n elements require at most n+min{k, n − k}+ o(n) comparisons on average, even when equal elements occur. This parallels our recent analysis of another variant due to Floyd and Rivest [Comm. ACM 18 (1975) 165–172]. Our computational results suggest that both variants per...
متن کاملQuicksort with median of medians is considered practical
Quicksort[2, 1, 3] is one of the most efficient and widely used sorting algorithms. The major drawback of quicksort is that worst case time complexity of naive implementations of quicksort is O(n2) with input size n. In order to avoid this worst case behavior, a variant of quicksort, so-called introsort[4] 1 , is often used. There exists another solution to keep the worst case complexity of qui...
متن کاملRandomized selection with quintary partitions
We show that several versions of Floyd and Rivest’s algorithm Select for finding the kth smallest of n elements require at most n+min{k, n− k}+ o(n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Our computational results confirm that Select may be the best algorithm in practice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Math.
دوره 82 شماره
صفحات -
تاریخ انتشار 2005